Approximating minimum size {1,2}-connected networks
نویسندگان
چکیده
منابع مشابه
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Abstract An e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V E There are four versions of the problem and the approximation guarantees are as followsAn e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V ...
متن کاملApproximating the Minimum Bisection Size
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n=2. The bisection size is the number of edges connecting the two sets. Finding the bisection of minimum size is NP-hard. We present an algorithm that nds a bisection that is within O(p n log n) of optimal. No sublinear approximation ratio for bisection was previously known.
متن کاملApproximating Minimum Manhattan Networks
Given a set S of n points in the plane, we deene a Manhattan Network on S as a rectilinear network G with the property that for every pair of points in S, the network G contains the shortest rectilinear path between them. A Minimum Manhattan Network on S is a Manhattan network of minimum possible length. A Manhattan network can be thought of as a graph G = (V; E), where the vertex set V corresp...
متن کاملApproximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)
An efficient heuristic is presented for the problem of finding a minimum-size kconnected spanning subgraph of an (undirected or directed) simple graph G = (V,E). There are four versions of the problem, and the approximation guarantees are as follows: • minimum-size k-node connected spanning subgraph of an undirected graph 1 + [1/k], • minimum-size k-node connected spanning subgraph of a directe...
متن کاملApproximating the Minimum Strongly Connected Subgraph via a
Lower Bound. Adrian Vetta Abstract We present a 32 -approximation algorithm for the problem of nding a minimum strongly connected spanning subgraph in a given directed graph. As a corollary we obtain a 3 2 -approximation algorithm for the more general minimum equivalent digraph problem. The performance of our algorithm is measured against a lower bound obtained from a simple matching problem. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00199-3